The firing squad synchronization problem for two-dimensional arrays
نویسندگان
چکیده
منابع مشابه
Synchronization of Cellular Arrays: The Firing Squad Problem in Two Dimensions
are copies of a single synchronous finite-state machine M. The internal state of a cell at time t @ 1 depends on its internal state and on the internal states of its left and right neighbors at time t. At time t 0, one of the end cells (called "the general") enters an internal state s, ("fire when ready"), while all other cells (called "the soldiers") are in a quiescent state sq. The array must...
متن کاملThe Firing Squad Synchronization Problem with Many Generals For One-Dimensional CA
The Firing Squad Synchronization Problem is one of the classical problems for cellular automata. In this paper we consider the case of more than one general. A synchronous and an asynchronous version of the problem are considered. In the latter case the generals may start their activities at different times. In the synchronous case there are optimumtime solutions. Very simple and elegant techni...
متن کاملOn Optimal Solutions to the Firing Squad Synchronization Problem
The one-dimensional firing squad synchronization problem (FSSP) is to construct a generic automaton of a one dimensional cellular network made of a segment of n identical machines so that, whatever the length n of the segment is, 1. if, at the starting time (t = 1 in the following), all finite automata of the cellular network (called cells) are in a quiescent state L and no meaningful piece of ...
متن کاملAbout 4-States Solutions to the Firing Squad Synchronization Problem
We present some elements of a new family of time-optimal solutions to a less restrictive firing squad synchronization problem. These solutions are all built on top of some elementary algebraic cellular automata. Thus, this gives a very new insight on the problem and a more general way of computing on cellular automata.
متن کاملFiring Squad Synchronization Problem in Reversible Cellular Automata
We studied the Firing Squad Synchronization Problem (FSSP) on reversible (i.e., backward deterministic) cellular automata (RCA). First we proved that, in the case of RCA, there is no solution under the usual condition for FSSP where the firing state is only one. So we defined a little weaker condition suitable for RCA in which finite number of firing states are allowed. We showed that Minsky’s ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1977
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(77)90273-x